Permutation Entropy Based on Non-Uniform Embedding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-dimensional approximation searching strategy for transfer entropy from non-uniform embedding

Transfer entropy from non-uniform embedding is a popular tool for the inference of causal relationships among dynamical subsystems. In this study we present an approach that makes use of low-dimensional conditional mutual information quantities to decompose the original high-dimensional conditional mutual information in the searching procedure of non-uniform embedding for significant variables ...

متن کامل

Permutation entropy

Permutation entropy is computationally efficient, robust to outliers, and effective to measure complexity of time series. We used this technique to quantify the complexity of continuous vital signs recorded from patients with traumatic brain injury (TBI). Using permutation entropy calculated from early vital signs (initial 10~20% of patient hospital stay time), we built classifiers to predict i...

متن کامل

Regional differentiation based on permutation entropy and its geographical explanation

The study area, located in the southwest of Yunnan Province, has a distinct regional difference in both topography and climate system. Western region belongs to the Southwestern Yunnan mountainous area with varied landforms while eastern region is a part of Eastern Yunnan Plateau whose terrain is rather flat relatively. And different regions are influenced by different climates, which have resu...

متن کامل

Algorithm of Image Encryption based on Permutation Information Entropy

Criterion for choosing chaos map to drive image bit permutation based on chaos permutation information entropy is proposed. An algorithm for image bit permutation is designed based on the fact that the output trajectory of chaotic system is very unpredictable. Image smallest granularity scrambling, namely, bit space maximum scrambling is implemented by applying the chaos that has been selected....

متن کامل

A Non-Parametric Independence Test Using Permutation Entropy

In the present paper we construct a new, simple and powerful test for independence by using symbolic dynamics and permutation entropy as a measure of serial dependence. We also give the asymptotic distribution of an affine transformation of the permutation entropy under the null hypothesis of independence. An application to several daily financial time series illustrates our approach.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2018

ISSN: 1099-4300

DOI: 10.3390/e20080612